A point-to-point discrete-time scheduling problem of transmitting $B$information bits within $T$ hard delay deadline slots is considered assumingthat the underlying energy-bit cost function is a convex monomial. Thescheduling objective is to minimize the expected energy expenditure whilesatisfying the deadline constraint based on information about the unservedbits, channel state/statistics, and the remaining time slots to the deadline.At each time slot, the scheduling decision is made without knowledge of futurechannel state, and thus there is a tension between serving many bits when thecurrent channel is good versus leaving too many bits for the deadline. Underthe assumption that no other packet is scheduled concurrently and no outage isallowed, we derive the optimal scheduling policy. Furthermore, we alsoinvestigate the dual problem of maximizing the number of transmitted bits over$T$ time slots when subject to an energy constraint.
展开▼
机译：假设基础能量位成本函数是凸单项式，则考虑在$ T $硬延迟截止时间段内传输$ B $信息位的点对点离散时间调度问题。调度目标是基于有关未服务位，信道状态/统计信息以及截止期限的剩余时隙的信息，在满足截止期限约束的同时使预期的能源消耗最小化。因此，当当前频道良好时，服务许多位与在截止日期前保留太多位之间存在着紧张关系。在没有其他数据包被同时调度且不允许中断的情况下，我们得出了最佳调度策略。此外，我们还研究了双重问题，即在受到能量约束的情况下，最大化超过$ T $时隙的传输比特数。
展开▼
